A two-stage ranking method to minimize ordinal violation for pairwise comparisons
نویسندگان
چکیده
منابع مشابه
Active Ranking using Pairwise Comparisons
This paper examines the problem of ranking a collection of objects using pairwise comparisons (rankings of two objects). In general, the ranking of n objects can be identified by standard sorting methods using n log2 n pairwise comparisons. We are interested in natural situations in which relationships among the objects may allow for ranking using far fewer pairwise comparisons. Specifically, w...
متن کاملEfficient Ranking from Pairwise Comparisons
The ranking of n objects based on pairwise comparisons is a core machine learning problem, arising in recommender systems, ad placement, player ranking, biological applications and others. In many practical situations the true pairwise comparisons cannot be actively measured, but a subset of all n(n−1)/2 comparisons is passively and noisily observed. Optimization algorithms (e.g., the SVM) coul...
متن کاملApproximate Ranking from Pairwise Comparisons
A common problem in machine learning is to rank a set of n items based on pairwise comparisons. Here ranking refers to partitioning the items into sets of pre-specified sizes according to their scores, which includes identification of the top-k items as the most prominent special case. The score of a given item is defined as the probability that it beats a randomly chosen other item. Finding an...
متن کاملA two-stage model for ranking DMUs using DEA/AHP
In this paper, we present a two-stage model for ranking of decision making units (DMUs) using interval analytic hierarchy process (AHP). Since the efficiency score of unity is assigned to the efficient units, we evaluate the efficiency of each DMU by basic DEA models and calculate the weights of the criteria using proposed model. In the first stage, the proposed model evaluates decision making...
متن کاملRank Centrality: Ranking from Pairwise Comparisons
The question of aggregating pairwise comparisons to obtain a global ranking over a collection of objects has been of interest for a very long time: be it ranking of online gamers (e.g. MSR’s TrueSkill system) and chess players, aggregating social opinions, or deciding which product to sell based on transactions. In most settings, in addition to obtaining a ranking, finding ‘scores’ for each obj...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Soft Computing
سال: 2021
ISSN: 1568-4946
DOI: 10.1016/j.asoc.2021.107287